The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0, S(x)) → h(0, x)
h(0, 0) → 0
g(S(x), 0) → 0
f(S(x), 0) → 0
h(S(x), x2) → h(x, x2)
g(0, x2) → 0
f(0, x2) → 0

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0', S(x)) → h(0', x)
h(0', 0') → 0'
g(S(x), 0') → 0'
f(S(x), 0') → 0'
h(S(x), x2) → h(x, x2)
g(0', x2) → 0'
f(0', x2) → 0'

S is empty.
Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0', S(x)) → h(0', x)
h(0', 0') → 0'
g(S(x), 0') → 0'
f(S(x), 0') → 0'
h(S(x), x2) → h(x, x2)
g(0', x2) → 0'
f(0', x2) → 0'

Types:
f :: S:0' → S:0' → S:0'
S :: S:0' → S:0'
h :: S:0' → S:0' → S:0'
g :: S:0' → S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
f, h, g

They will be analysed ascendingly in the following order:
h < f
f = g
h < g

(6) Obligation:

Innermost TRS:
Rules:
f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0', S(x)) → h(0', x)
h(0', 0') → 0'
g(S(x), 0') → 0'
f(S(x), 0') → 0'
h(S(x), x2) → h(x, x2)
g(0', x2) → 0'
f(0', x2) → 0'

Types:
f :: S:0' → S:0' → S:0'
S :: S:0' → S:0'
h :: S:0' → S:0' → S:0'
g :: S:0' → S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Generator Equations:
gen_S:0'2_0(0) ⇔ 0'
gen_S:0'2_0(+(x, 1)) ⇔ S(gen_S:0'2_0(x))

The following defined symbols remain to be analysed:
h, f, g

They will be analysed ascendingly in the following order:
h < f
f = g
h < g

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)

Induction Base:
h(gen_S:0'2_0(0), gen_S:0'2_0(0)) →_R^Ω(1)
0'

Induction Step:
h(gen_S:0'2_0(0), gen_S:0'2_0(+(n4_0, 1))) →_R^Ω(1)
h(0', gen_S:0'2_0(n4_0)) →_IH
gen_S:0'2_0(0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0', S(x)) → h(0', x)
h(0', 0') → 0'
g(S(x), 0') → 0'
f(S(x), 0') → 0'
h(S(x), x2) → h(x, x2)
g(0', x2) → 0'
f(0', x2) → 0'

Types:
f :: S:0' → S:0' → S:0'
S :: S:0' → S:0'
h :: S:0' → S:0' → S:0'
g :: S:0' → S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Lemmas:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_S:0'2_0(0) ⇔ 0'
gen_S:0'2_0(+(x, 1)) ⇔ S(gen_S:0'2_0(x))

The following defined symbols remain to be analysed:
g, f

They will be analysed ascendingly in the following order:
f = g

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
g(gen_S:0'2_0(+(1, n867_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n867₀)

Induction Base:
g(gen_S:0'2_0(+(1, 0)), gen_S:0'2_0(1))

Induction Step:
g(gen_S:0'2_0(+(1, +(n867_0, 1))), gen_S:0'2_0(1)) →_R^Ω(1)
h(f(S(gen_S:0'2_0(+(1, n867_0))), S(gen_S:0'2_0(0))), g(gen_S:0'2_0(+(1, n867_0)), S(S(S(gen_S:0'2_0(0)))))) →_R^Ω(1)
h(h(g(gen_S:0'2_0(+(1, n867_0)), S(gen_S:0'2_0(0))), f(S(S(S(gen_S:0'2_0(+(1, n867_0))))), gen_S:0'2_0(0))), g(gen_S:0'2_0(+(1, n867_0)), S(S(S(gen_S:0'2_0(0)))))) →_IH
h(h(*3_0, f(S(S(S(gen_S:0'2_0(+(1, n867_0))))), gen_S:0'2_0(0))), g(gen_S:0'2_0(+(1, n867_0)), S(S(S(gen_S:0'2_0(0)))))) →_R^Ω(1)
h(h(*3_0, 0'), g(gen_S:0'2_0(+(1, n867_0)), S(S(S(gen_S:0'2_0(0)))))) →_R^Ω(1)
h(h(*3_0, 0'), h(f(S(gen_S:0'2_0(n867_0)), S(S(S(gen_S:0'2_0(0))))), g(gen_S:0'2_0(n867_0), S(S(S(S(S(gen_S:0'2_0(0))))))))) →_R^Ω(1)
h(h(*3_0, 0'), h(h(g(gen_S:0'2_0(n867_0), S(S(S(gen_S:0'2_0(0))))), f(S(S(S(gen_S:0'2_0(n867_0)))), S(S(gen_S:0'2_0(0))))), g(gen_S:0'2_0(n867_0), S(S(S(S(S(gen_S:0'2_0(0)))))))))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(11) Complex Obligation (BEST)

(12) Obligation:

Innermost TRS:
Rules:
f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0', S(x)) → h(0', x)
h(0', 0') → 0'
g(S(x), 0') → 0'
f(S(x), 0') → 0'
h(S(x), x2) → h(x, x2)
g(0', x2) → 0'
f(0', x2) → 0'

Types:
f :: S:0' → S:0' → S:0'
S :: S:0' → S:0'
h :: S:0' → S:0' → S:0'
g :: S:0' → S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Lemmas:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_S:0'2_0(+(1, n867_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n867₀)

Generator Equations:
gen_S:0'2_0(0) ⇔ 0'
gen_S:0'2_0(+(x, 1)) ⇔ S(gen_S:0'2_0(x))

The following defined symbols remain to be analysed:
f

They will be analysed ascendingly in the following order:
f = g

(13) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
f(gen_S:0'2_0(+(1, n3791_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n3791₀)

Induction Base:
f(gen_S:0'2_0(+(1, 0)), gen_S:0'2_0(1))

Induction Step:
f(gen_S:0'2_0(+(1, +(n3791_0, 1))), gen_S:0'2_0(1)) →_R^Ω(1)
h(g(gen_S:0'2_0(+(1, n3791_0)), S(gen_S:0'2_0(0))), f(S(S(S(gen_S:0'2_0(+(1, n3791_0))))), gen_S:0'2_0(0))) →_R^Ω(1)
h(h(f(S(gen_S:0'2_0(n3791_0)), S(gen_S:0'2_0(0))), g(gen_S:0'2_0(n3791_0), S(S(S(gen_S:0'2_0(0)))))), f(S(S(S(gen_S:0'2_0(+(1, n3791_0))))), gen_S:0'2_0(0))) →_IH
h(h(*3_0, g(gen_S:0'2_0(n3791_0), S(S(S(gen_S:0'2_0(0)))))), f(S(S(S(gen_S:0'2_0(+(1, n3791_0))))), gen_S:0'2_0(0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(14) Complex Obligation (BEST)

(15) Obligation:

Innermost TRS:
Rules:
f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0', S(x)) → h(0', x)
h(0', 0') → 0'
g(S(x), 0') → 0'
f(S(x), 0') → 0'
h(S(x), x2) → h(x, x2)
g(0', x2) → 0'
f(0', x2) → 0'

Types:
f :: S:0' → S:0' → S:0'
S :: S:0' → S:0'
h :: S:0' → S:0' → S:0'
g :: S:0' → S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Lemmas:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_S:0'2_0(+(1, n867_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n867₀)
f(gen_S:0'2_0(+(1, n3791_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n3791₀)

Generator Equations:
gen_S:0'2_0(0) ⇔ 0'
gen_S:0'2_0(+(x, 1)) ⇔ S(gen_S:0'2_0(x))

The following defined symbols remain to be analysed:
g

They will be analysed ascendingly in the following order:
f = g

(16) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
g(gen_S:0'2_0(+(1, n9137_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n9137₀)

Induction Base:
g(gen_S:0'2_0(+(1, 0)), gen_S:0'2_0(1))

Induction Step:
g(gen_S:0'2_0(+(1, +(n9137_0, 1))), gen_S:0'2_0(1)) →_R^Ω(1)
h(f(S(gen_S:0'2_0(+(1, n9137_0))), S(gen_S:0'2_0(0))), g(gen_S:0'2_0(+(1, n9137_0)), S(S(S(gen_S:0'2_0(0)))))) →_R^Ω(1)
h(h(g(gen_S:0'2_0(+(1, n9137_0)), S(gen_S:0'2_0(0))), f(S(S(S(gen_S:0'2_0(+(1, n9137_0))))), gen_S:0'2_0(0))), g(gen_S:0'2_0(+(1, n9137_0)), S(S(S(gen_S:0'2_0(0)))))) →_IH
h(h(*3_0, f(S(S(S(gen_S:0'2_0(+(1, n9137_0))))), gen_S:0'2_0(0))), g(gen_S:0'2_0(+(1, n9137_0)), S(S(S(gen_S:0'2_0(0)))))) →_R^Ω(1)
h(h(*3_0, 0'), g(gen_S:0'2_0(+(1, n9137_0)), S(S(S(gen_S:0'2_0(0)))))) →_R^Ω(1)
h(h(*3_0, 0'), h(f(S(gen_S:0'2_0(n9137_0)), S(S(S(gen_S:0'2_0(0))))), g(gen_S:0'2_0(n9137_0), S(S(S(S(S(gen_S:0'2_0(0))))))))) →_R^Ω(1)
h(h(*3_0, 0'), h(h(g(gen_S:0'2_0(n9137_0), S(S(S(gen_S:0'2_0(0))))), f(S(S(S(gen_S:0'2_0(n9137_0)))), S(S(gen_S:0'2_0(0))))), g(gen_S:0'2_0(n9137_0), S(S(S(S(S(gen_S:0'2_0(0)))))))))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(17) Complex Obligation (BEST)

(18) Obligation:

Innermost TRS:
Rules:
f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0', S(x)) → h(0', x)
h(0', 0') → 0'
g(S(x), 0') → 0'
f(S(x), 0') → 0'
h(S(x), x2) → h(x, x2)
g(0', x2) → 0'
f(0', x2) → 0'

Types:
f :: S:0' → S:0' → S:0'
S :: S:0' → S:0'
h :: S:0' → S:0' → S:0'
g :: S:0' → S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Lemmas:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_S:0'2_0(+(1, n9137_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n9137₀)
f(gen_S:0'2_0(+(1, n3791_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n3791₀)

Generator Equations:
gen_S:0'2_0(0) ⇔ 0'
gen_S:0'2_0(+(x, 1)) ⇔ S(gen_S:0'2_0(x))

No more defined symbols left to analyse.

(19) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)

(20) BOUNDS(n^1, INF)

(21) Obligation:

Innermost TRS:
Rules:
f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0', S(x)) → h(0', x)
h(0', 0') → 0'
g(S(x), 0') → 0'
f(S(x), 0') → 0'
h(S(x), x2) → h(x, x2)
g(0', x2) → 0'
f(0', x2) → 0'

Types:
f :: S:0' → S:0' → S:0'
S :: S:0' → S:0'
h :: S:0' → S:0' → S:0'
g :: S:0' → S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Lemmas:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_S:0'2_0(+(1, n9137_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n9137₀)
f(gen_S:0'2_0(+(1, n3791_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n3791₀)

Generator Equations:
gen_S:0'2_0(0) ⇔ 0'
gen_S:0'2_0(+(x, 1)) ⇔ S(gen_S:0'2_0(x))

No more defined symbols left to analyse.

(22) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)

(23) BOUNDS(n^1, INF)

(24) Obligation:

Innermost TRS:
Rules:
f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0', S(x)) → h(0', x)
h(0', 0') → 0'
g(S(x), 0') → 0'
f(S(x), 0') → 0'
h(S(x), x2) → h(x, x2)
g(0', x2) → 0'
f(0', x2) → 0'

Types:
f :: S:0' → S:0' → S:0'
S :: S:0' → S:0'
h :: S:0' → S:0' → S:0'
g :: S:0' → S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Lemmas:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_S:0'2_0(+(1, n867_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n867₀)
f(gen_S:0'2_0(+(1, n3791_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n3791₀)

Generator Equations:
gen_S:0'2_0(0) ⇔ 0'
gen_S:0'2_0(+(x, 1)) ⇔ S(gen_S:0'2_0(x))

No more defined symbols left to analyse.

(25) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)

(26) BOUNDS(n^1, INF)

(27) Obligation:

Innermost TRS:
Rules:
f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0', S(x)) → h(0', x)
h(0', 0') → 0'
g(S(x), 0') → 0'
f(S(x), 0') → 0'
h(S(x), x2) → h(x, x2)
g(0', x2) → 0'
f(0', x2) → 0'

Types:
f :: S:0' → S:0' → S:0'
S :: S:0' → S:0'
h :: S:0' → S:0' → S:0'
g :: S:0' → S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Lemmas:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)
g(gen_S:0'2_0(+(1, n867_0)), gen_S:0'2_0(1)) → *3_0, rt ∈ Ω(n867₀)

Generator Equations:
gen_S:0'2_0(0) ⇔ 0'
gen_S:0'2_0(+(x, 1)) ⇔ S(gen_S:0'2_0(x))

No more defined symbols left to analyse.

(28) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)

(29) BOUNDS(n^1, INF)

(30) Obligation:

Innermost TRS:
Rules:
f(S(x'), S(x)) → h(g(x', S(x)), f(S(S(S(x'))), x))
g(S(x), S(x')) → h(f(S(x), S(x')), g(x, S(S(S(x')))))
h(0', S(x)) → h(0', x)
h(0', 0') → 0'
g(S(x), 0') → 0'
f(S(x), 0') → 0'
h(S(x), x2) → h(x, x2)
g(0', x2) → 0'
f(0', x2) → 0'

Types:
f :: S:0' → S:0' → S:0'
S :: S:0' → S:0'
h :: S:0' → S:0' → S:0'
g :: S:0' → S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Lemmas:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_S:0'2_0(0) ⇔ 0'
gen_S:0'2_0(+(x, 1)) ⇔ S(gen_S:0'2_0(x))

No more defined symbols left to analyse.

(31) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
h(gen_S:0'2_0(0), gen_S:0'2_0(n4_0)) → gen_S:0'2_0(0), rt ∈ Ω(1 + n4₀)

(32) BOUNDS(n^1, INF)